Rules and Arithmetics
نویسنده
چکیده
This paper is concerned with the logical structure of arithmetical the ories We survey results concerning logics and admissible rules of con structive arithmetical theories We prove a new theorem the admissible propositional rules of Heyting Arithmetic are the same as the admissible propositional rules of Intuitionistic Propositional Logic We provide some further insights concerning predicate logical admissible rules for arithmeti cal theories
منابع مشابه
The Arithmetics of a Theory
In this paper we study the interpretations of a weak arithmetic, like Buss’ theory S2, in a given theory U . We call these interpretations the arithmetics of U . We develop the basics of the structure of the arithmetics of U . We study the provability logic(s) of U from the standpoint of the framework of the arithmetics of U . Finally, we provide a deeper study of the arithmetics of a finitely ...
متن کاملFinite Arithmetics
Let FM (A), for A = (ω, . . .), be a family of finite, initial segments of A. One can see FM (A) as a family of finite arithmetics related to the arithmetic A. In the talk I will survey what is known about such arithmetics and their logical properties. The main questions will be the following: What is the complexity of theories of such families? What relations can be represented in such familie...
متن کاملA Note on Priest's Finite Inconsistent Arithmetics
We give a complete characterization of Priest’s Finite Inconsistent Arithmetics observing that his original putative characterization included arithmetics which cannot in fact be realized.
متن کاملClassifying and Formally Verifying Integer Constant Folding
Constant folding is a well-known optimization of compilers which evaluates constant expressions already at compile time. Constant folding is valid only if the results computed by the compiler are exactly the same as the results which would be computed at run-time by the target machine arithmetic. We classify different arithmetics by deriving a general condition under which a target-machine arit...
متن کاملAutomated methods for formal proofs in simple arithmetics and algebra
In an LCF-like theorem prover, any proof must be produced from a small set of inference rules. The development of automated proof methods in such systems is extremely important. In this thesis we study the following question How should we integrate a proof procedure in an LCF-like theorem prover, both in general and in the special case of arithmetics. We investigate three integration paradigms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 40 شماره
صفحات -
تاریخ انتشار 1999